Maximum-Area Quadrilateral in a Convex Polygon, Revisited
نویسندگان
چکیده
In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder [1] for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the optimal solution for k = 4. This question, posed by Keikha et al. [2] who show that the presented method fails to find the optimal solution for k = 3.
منابع مشابه
Maximum-Area Triangle in a Convex Polygon, Revisited
We revisit the following problem: Given a convex polygon P , find the largest-area inscribed triangle. We show by example that the linear-time algorithm presented in 1979 by Dobkin and Snyder [1] for solving this problem fails. We then proceed to show that with a small adaptation, their approach does lead to a quadratic-time algorithm. We also present a more involved O(n logn) time divide-and-c...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملTerm Paper : “ the Happy Ending Problem ” Due April 12 , 2011
At one of their meetings, Klein challenged the group to solve a complex problem in planar geometry. Klein proposed that the group consider five points on a flat surface, where no three of the five formed a straight line. It was obvious to all that when four of the points were joined, they formed a quadrilateral, but Klein also noticed that given five points, four of them always appeared to defi...
متن کاملFinding the Maximum Area Parallelogram in a Convex Polygon
We consider the problem of finding the maximum area parallelogram (MAP) inside a given convex polygon. Our main result is an algorithm for computing the MAP in an n-sided polygon in O(n2) time. Achieving this running time requires proving several new structural properties of the MAP, and combining them with a rotating technique of Toussaint [10]. We also discuss applications of our result to th...
متن کاملFinding all Maximal Area Parallelograms in a Convex Polygon
We consider the problem of finding the maximum area parallelogram (MAP) inside a given convex polygon. Our main result is an algorithm for computing the MAP in an n-sided polygon in O(n) time. Achieving this running time requires proving several new structural properties of the MAP. Our algorithm actually computes all the locally maximal area parallelograms (LMAPs). In addition to the algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.00681 شماره
صفحات -
تاریخ انتشار 2017